import avltree.AVLTree;
import bitset.MyBitSet;
import rbtree.RBTree;

public class Test {
    public static void main(String[] args) {
        int[] array = {16, 3, 7, 11, 9, 18, 14, 15};
        MyBitSet myBitSet = new MyBitSet(18);
        for(int i = 0; i < array.length; i++) {
            myBitSet.set(array[i]);
        }
        //给数组排序
        for(int i = 0; i < myBitSet.elem.length; i++) {
            for(int j = 0; j < 8; j++) {
                if((myBitSet.elem[i] & (1 << j)) != 0) {
                    System.out.print(i * 8 + j + " ");
                }
            }
        }
    }
}
